Cost-eeective Parallel Computing
نویسنده
چکیده
Many academic papers imply that parallel computing is only worthwhile when applications achieve nearly linear speedup (i.e., execute nearly p times faster on p processors). This note shows that parallel computing is cost-eeective whenever speedup exceeds costup| the parallel system cost divided by uniprocessor cost. Furthermore, when applications have large memory requirements (e.g., 512 megabytes), the costup|and hence speedup necessary to be cost-eeective|can be much less than linear.
منابع مشابه
Cost-eeective Data-parallel Load Balancing Cost-eeective Data-parallel Load Balancing
Load balancing algorithms improve a program's performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-eeective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon...
متن کاملRay Tracing Complex Scenes: Sequential or in Parallel?
We present a discussion whether current parallel machines or, preferable, fast sequential computers should be used to render images using ray tracing. Based on the deenitions of cost{eeective speedup and eeciency, we will show that shared memory machines have advantages over distributed memory machines. Moreover, the SB{Pram appears to be an architecture which allows for cost{eeective absolute ...
متن کاملParallel computing using MPI and OpenMP on self-configured platform, UMZHPC.
Parallel computing is a topic of interest for a broad scientific community since it facilitates many time-consuming algorithms in different application domains.In this paper, we introduce a novel platform for parallel computing by using MPI and OpenMP programming languages based on set of networked PCs. UMZHPC is a free Linux-based parallel computing infrastructure that has been developed to cr...
متن کاملMemory Hierarchy Considerations for Cost-eeective Cluster Computing
Using oo-the-shelf commodity workstations and PCs to build a cluster for parallel computing has become a common practice. The cost-eeectiveness of a cluster computing platform for a given budget and for certain types of applications is mainly determined by its memory hierarchy and the interconnection network conngurations of the cluster. Finding such a cost-eeective solution from exhaustive sim...
متن کاملBeneets of Processor Clustering in Designing Large Parallel Systems: When and How? 1
Scaling the size of parallel systems while maintaining the system performance is an important problem. A default scaling approach by using larger networks to interconnect more processors works only up to a limited extent and the derived conngurations using this approach are not cost-eeective. Recent advents in VLSI and packaging technologies now ooer multiple processors on a single multi-chip m...
متن کامل